Editorial: 2014 Glover-Klingman Prize winners

نویسندگان

  • Bruce L. Golden
  • Douglas R. Shier
چکیده

We are proud to announce the winners of the Glover-Klingman Prize for the best paper published in Networks in 2006. This prize pays tribute to the high quality work at the interface of operations research and computer science pioneered by Fred Glover and Darwin Klingman. However, the award recognizes outstanding work in the general area of network modeling, analysis, and implementation, and is not limited to papers at the OR/CS interface. There were 46 papers published in 2006, and a number of exceptional papers were nominated by our editorial board. The final selection was made by the two of us, after numerous consultations with the editorial board and outside experts. The winning paper, “Efficiency and Fairness of System-Optimal Routing with User Constraints,” appeared in December 2006. The authors, Andreas S. Schultz and Nicolás E. Stier-Moses are to be congratulated for their well-executed contribution to the literature. Each author will receive a cash award and a certificate bearing the following citation:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GMS German Medical Science: Best Paper Award 2013

For promotion of the scientific medical publications in the interdisciplinary e-journal GMS German Medical Science, the Editorial Board established a special prize for the best paper published in a certain time period. The article is selected by the Scientific Committee. The first award was given to the authors for the best paper among the articles published during the time period 2002 to 2012 ...

متن کامل

Improved Convexity Cuts for Lattice Point Problems

The generalized lattice point (GLF) problem provides a formulation that accommodates a var.lety of discrete alternative problems. In this paper we show how to substantlrlly strengthen the convexity cuts for the GLF problem. The new cuts are based on the identification of "synthesized" lattice point conditions to replace those that ordinarily define the cut. The synthesized conditions give an al...

متن کامل

The Singularly Constrained Genera . Lized Network

This paper presents a computationally efficient method for solving generalized network problems with an additional linear constraint. The method is basically the primal simplex method specialized to exploit the topological structure of the problem. The method is similar to the specialization of Charnes and Cooper's Double Reverse Method by Meier, and Klingman and Russell for constrained pure ne...

متن کامل

Webb Miller and Trey Ideker To Receive Top International Bioinformatics Awards for 2009 from the International Society for Computational Biology

Each year, the International Society for Computational Biology (ISCB; http:// www.iscb.org) makes two major awards to recognize excellence in the field of bioinformatics. The ISCB Awards Committee, composed of current and past directors of the Society and previous award winners, has announced that the 2009 ISCB Accomplishment by a Senior Scientist Award will be given to Webb Miller (Image 1) of...

متن کامل

Editorial: Nar Awards 2014

For the ninth year running, NAR and Oxford Journals have provided sponsorship and awarded travel bursaries and prizes to students in recognition of their outstanding achievements. This year, sponsorship and prizes were given at 13 different meetings. A list of the awards is presented below. Our warm congratulations go to the prize winners. Travel Sponsorship IS3NA XXI: International Round Table...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Networks

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2006